Flippable Pairs and Subset Comparisons in Comparative Probability Orderings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flippable Pairs and Subset Comparisons in Comparative Probability Orderings

We show that every additively representable comparative probability order on n atoms is determined by at least n − 1 binary subset comparisons. We show that there are many orders of this kind, not just the lexicographic order. These results provide answers to two questions of Fishburn et al (2002). We also study the flip relation on the class of all comparative probability orders introduced by ...

متن کامل

Answers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings

We show that every additively representable comparative probability ordering is determined by at least n− 1 binary subset comparisons. We show that there are many orderings of this kind, not just the lexicographic ordering. These results provide answers to two questions asked by Fishburn.

متن کامل

On the Existence of Extremal Cones and Comparative Probability Orderings

We study the recently discovered phenomenon [1] of existence of comparative probability orderings on finite sets that violate Fishburn hypothesis [2, 3] — we call such orderings and the discrete cones associated with them extremal. Conder and Slinko constructed an extremal discrete cone on the set of n = 7 elements and showed that no extremal cones exist on the set of n ≤ 6 elements. In this pa...

متن کامل

Ladder orderings of pairs and RAID performance

In a systematic erasure code for the correction of two simultaneous erasures, each information symbol must have two associated parity symbols. When implemented in a redundant array of independent disks (RAID), performance requirements on the update penalty necessitate that each information symbol be associated with no more parity symbols than the two required. This leads to a simple graph model...

متن کامل

Ratio Orderings and Comparative Statics

Monotone ratio orderings are refinements of first order stochastic dominance that allow monotone comparative statics results in games of incomplete information. We develop analogous refinements for second order stochastic dominance based on the monotonicity of the cumulative probability ratio and the unimodality of the likelihood and probability ratios. We go on to investigate comparative stati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Order

سال: 2007

ISSN: 0167-8094,1572-9273

DOI: 10.1007/s11083-007-9068-y